Spatiotemporal clustering using Gaussian processes embedded in a mixture model

نویسندگان

چکیده

The categorization of multidimensional data into clusters is a common task in statistics. Many applications clustering, including the majority tasks ecology, use that inherently spatial and often also temporal. However, spatiotemporal dependence typically ignored when clustering multivariate data. We present finite mixture model for incorporates autocorrelation by appropriate Gaussian processes (GP) mixing proportions. allow flexible semiparametric on environmental covariates, once again using GPs. propose to Bayesian inference through three tiers approximate methods: Laplace approximation allows efficient analysis large datasets, both partial full Markov chain Monte Carlo (MCMC) approaches improve accuracy at cost increased computational time. Comparison methods shows useful alternative MCMC methods. A decadal 253 species teleost fish from 854 samples collected along biodiverse northwestern continental shelf Australia between 1986 1997 added clarity provided accounting autocorrelation. For these data, temporal comparatively small, which an important finding given changing human pressures over this

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

­­Image Segmentation using Gaussian Mixture Model

Abstract: Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we used Gaussian mixture model to the pixels of an image. The parameters of the model were estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image was made by Bayes rule. In fact,...

متن کامل

IMAGE SEGMENTATION USING GAUSSIAN MIXTURE MODEL

  Stochastic models such as mixture models, graphical models, Markov random fields and hidden Markov models have key role in probabilistic data analysis. In this paper, we have learned Gaussian mixture model to the pixels of an image. The parameters of the model have estimated by EM-algorithm.   In addition pixel labeling corresponded to each pixel of true image is made by Bayes rule. In fact, ...

متن کامل

Kernel Trick Embedded Gaussian Mixture Model

In this paper, we present a kernel trick embedded Gaussian Mixture Model (GMM), called kernel GMM. The basic idea is to embed kernel trick into EM algorithm and deduce a parameter estimation algorithm for GMM in feature space. Kernel GMM could be viewed as a Bayesian Kernel Method. Compared with most classical kernel methods, the proposed method can solve problems in probabilistic framework. Mo...

متن کامل

A Novel Evolutionary Clustering Algorithm Based on Gaussian Mixture Model

Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. Traditional clustering algorithms usually predefine the number of clusters via random selection or contend based knowledge. An improper pre-selection for the number of clusters may easily lead to bad clustering outcome. In order to address this issue we propose in this paper a new ev...

متن کامل

MiDGaP: Mixture Density Gaussian Processes

Gaussian Processes (GPs) have become a core technique in machine learning over the last decade, with numerous extensions and applications. Although several approaches exist for warping the conditional Gaussian posterior distribution to other members of the exponential family, most tacitly assume a unimodal posterior. In this paper we present a mixture density model (MDM) allowing multi-modal po...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Environmetrics

سال: 2021

ISSN: ['1180-4009', '1099-095X']

DOI: https://doi.org/10.1002/env.2681